Fides: A System for Verifiable Computation Using Smart Contracts

نویسندگان

چکیده

Verifiable computation allows a resource-constrained client to outsource their powerful servers, and efficiently verify received results. Cryptographic verifiable systems, despite elegant designs, have limited application in practice because of the computational cost difficulty correct flexible implementation complex cryptographic systems. An attractive approach verifiably compute general functions is use more than one server same function, decide result based on submitted results all servers. In this paper, we propose system for delegation two cloud servers using smart contract (SC), that guarantees as long at least honest. Our work adapts Refereed Delegation Computation (RDoC) model Canetti, Riva Rothblum (ACM CCS’11) SC setting. This was first considered by Avizheh et al. CCSW’19) who showed direct employment RDoC setting will be insecure copy attack, where copies other server, becomes possible due transparency SC. However, protocol left future work. new SC-aided design with proved security significantly reduces contract. Additionally, it provides against misbehaviours an over Ethereum blockchain. The proposed system, which called Fides, RDoC. We discuss challenges our decisions, present analysis example computation. also extensions directions research.

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Raziel: Private and Verifiable Smart Contracts on Blockchains

Raziel combines secure multi-party computation and proof-carrying code to provide privacy, correctness and verifiability guarantees for smart contracts on blockchains. Effectively solving DAO and Gyges attacks, this paper describes an implementation and presents examples to demonstrate its practical viability (e.g., private and verifiable crowdfundings and investment funds, double auctions for ...

متن کامل

Verifiable computation using multiple provers

The increasing ubiquity of the cloud computing paradigm has renewed focus on the classical problem ofallowing weak clients to check the results of computation delegated to powerful servers. Recent advancesin proof-based verifiable computation have led to several near-practical protocols. Protocols based oninteractive proofs (IPs) work with highly restrictive models of computation an...

متن کامل

Hybrid Publicly Verifiable Computation

Publicly Verifiable Outsourced Computation (PVC) allows weak devices to delegate computations to more powerful servers, and to verify the correctness of results. Delegation and verification rely only on public parameters, and thus PVC lends itself to large multi-user systems where entities need not be registered. In such settings, individual user requirements may be diverse and cannot be realis...

متن کامل

BitML: a calculus for Bitcoin smart contracts

We propose a domain-specific language for smart contracts, which allows participants to transfer cryptocurrency according to agreed contract terms. We define a symbolic and a computational model for reasoning about their security. In the symbolic model, participants act according to the semantics of the domain-specific language. Instead, in the computational model they exchange bitstrings, and ...

متن کامل

Smart Contracts for Bribing Miners

We present three smart contracts that allow a briber to fairly exchange bribes to miners who pursue a mining strategy benefiting the briber. The first contract, CensorshipCon, highlights that Ethereum’s uncle block reward policy can directly subsidise the cost of bribing miners. The second contract, HistoryRevisionCon, rewards miners via an in-band payment for reversing transactions or enforcin...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Lecture Notes in Computer Science

سال: 2023

ISSN: ['1611-3349', '0302-9743']

DOI: https://doi.org/10.1007/978-3-031-32415-4_29